Declarative, Secure, Convergent Edge Computation
نویسنده
چکیده
Eventual consistency is a more natural model than strong consistency for a distributed system, since it is closer to the underlying physical reality. Therefore, we propose that it is important to find a programming model that is both congenial to developers and supports eventual consistency. In particular, we consider that a crucial test for such a model is that it should support edge computation in a both natural and secure way. We present a preliminary work report with an initial solution, called Lasp, which resembles a concurrent functional language while naturally supporting an eventually consistent coordination-free distribution model.
منابع مشابه
An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things
Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...
متن کاملSecure Multiparty Computation 4.1.1 Overview of Dining Cryptographers (dc) Problem . . . . . . . . . . . 41 List of Figures
Ray Kresman, Advisor Data mining algorithms help reveal hidden information in a repository. Distributed mining algorithms meet this need by distributing data and computation. One of the most important issues of these algorithms is how to safely mine the data. Secure Multiparty Computation (SMC), a framework for safe mining of distributed data, provides some security promises of the computation....
متن کاملConvergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, linear time algorithms are proposed to decide the existence of a convergent transfer subgraph and, if one exists, to construct such a subgraph, respectively. The convergent transfer subgraph (CTS) problem arises from th...
متن کاملA Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction
ion Vı́tor Rodrigues, Benny Akesson, Simão Melo de Sousa, Mário Florido 1 RELiablE And SEcure Computation Group Universidade da Beira Interior, Covilhã, Portugal 2 DCC-Faculty of Science, Universidade do Porto, Portugal 3 LIACC, Universidade do Porto, Portugal 4 CISTER-ISEP Research Centre, Polytechnic Institute of Porto, Portugal Abstract. This paper presents a functional model for timing analy...
متن کاملRadio Networks with Reliable Communication
Problems of secure communication and computation have been studied extensively in network models, for example, Franklin and Yung have studied secure communications in the general networks modeled by hypergraphs. Radio networks have received special attention in recent years. For example, the Bluetooth and IEEE 802.11 networks are all based on radio network technologies. In this paper, we use di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1512.04898 شماره
صفحات -
تاریخ انتشار 2015